A general variable neighborhood search algorithm for the k-traveling salesman problem
نویسندگان
چکیده
منابع مشابه
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
Delivery Traveling Salesman Problem with LIFO Loading Francesco Carrabs Dipartimento di Matematica ed Informatica, Università di Salerno, 84084 Fisciano (SA), Italy [email protected] Jean-François Cordeau Canada Research Chair in Logistics and Transportation and Center for Research on Trasportation HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7 [email protected]...
متن کاملRandom gravitational emulation search algorithm (RGES (in scheduling traveling salesman problem
this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem. Random gravitational emulation search algorithm (RGES (is presented for solving traveling salesman problem. The algorithm based on random search concepts, and uses two parameters, speed and force of gravity in physics. The proposed algorithm is ...
متن کاملA reactive bone route algorithm for solving the traveling salesman problem
The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...
متن کاملan effective ant colony algorithm for the traveling salesman problem
the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is ...
متن کاملA Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2018
ISSN: 1877-0509
DOI: 10.1016/j.procs.2018.10.375